Binary polar codes are optimised codes for bitwise multistage decoding

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding

Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Arıkan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage decoding (OCBM), which have been discovered before by Stolte in 2002. The equivalence between the techniques used for the constructions and decodings of both codes ...

متن کامل

On decoding algorithms for polar codes

We consider the known list decoding algorithms for polar codes and compare their complexity.

متن کامل

List decoding of binary codes

We briefly survey some recent progress on list decoding algorithms for binary codes. The results discussed include: – Algorithms to list decode binary Reed-Muller codes of any order up to the minimum distance, generalizing the classical GoldreichLevin algorithm for RM codes of order 1 (Hadamard codes). These algorithms are “local” and run in time polynomial in the message length. – Construction...

متن کامل

List Decoding for Binary Goppa Codes

This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n− p n(n− 2t− 2) errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomialtime list-decoding algorithms for the same codes, the new algorithm corrects approximately t/2n extra errors.

متن کامل

Partial permutation decoding for binary Hadamard codes

Roland D. Barrolleta – Partial permutation decoding for binary Hadamard codes 1 Johann A. Briffa – Codes for Synchronization Error Correction 2 Wouter Castryck – Some two-torsion issues for curves in characteristic two 4 Gábor Fodor – Fingerprinting codes and their limits 5 E. Suárez-Canedo – About a class of Hadamard Propelinear Codes 6 Andrea Švob – On some transitive combinatorial structures...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics Letters

سال: 2016

ISSN: 0013-5194,1350-911X

DOI: 10.1049/el.2016.0837